Supermodular Functions on Finite Lattices

نویسندگان

  • S. David Promislow
  • Virginia R. Young
چکیده

The supermodular order on multivariate distributions has many applications in financial and actuarial mathematics. In the particular case of finite, discrete distributions, we generalize the order to distributions on finite lattices. In this setting, we focus on the generating cone of supermodular functions because the extreme rays of that cone (modulo the modular functions) can be used as test functions to determine whether two random variables are ordered under the supermodular order. We completely determine the extreme supermodular functions in some special cases. Mathematics Subject Classification (2000): 06B99 (Primary), 52A20 (Secondary).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction

Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The present paper strengthens this link. We study the problem of maximizing a supermodular function which is defined on a product of n copies of a fixed finite lattice and given by an oracle. We exhibit a large class of fini...

متن کامل

A note on supermodular sublattices in finite relatively complemented lattices

A sublattice in a lattice is called supermodular if, for every two elements, one of which belongs to the sublattice, at least one of their meet and join also belongs to the sublattice. In this note, we describe supermodular sublattices in products of relatively complemented lattices.

متن کامل

Identifying Efficiently Solvable Cases of Max CSP

In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. We describe a novel connection between this problem and the supermodular function maximization problem (which is dual to the submodular function minimization problem). Using this connection, we are able to identify large classes of efficiently solvable subproblems of M...

متن کامل

Abstract Interpretation of Supermodular Games

Supermodular games find significant applications in a variety of models, especially in operations research and economic applications of noncooperative game theory, and feature pure strategy Nash equilibria characterized as fixed points of multivalued functions on complete lattices. Pure strategy Nash equilibria of supermodular games are here approximated by resorting to the theory of abstract i...

متن کامل

Supermodularity and preferences

We uncover the complete ordinal implications of supermodularity on finite lattices under the assumption of weak monotonicity. In this environment, we show that supermodularity is ordinally equivalent to the notion of quasisupermodularity introduced by Milgrom and Shannon. We conclude that supermodularity is a weak property, in the sense that many preferences have a supermodular representation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Order

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2005